Complexity Results and Exact Algorithms for Robust Knapsack Problems
نویسندگان
چکیده
منابع مشابه
Complexity Results and Exact Algorithms for Robust Knapsack Problems
This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune from data uncertainty. We complement the works found in the literature, where uncertainty affects only the profits or only the weights of the items, by studying the complexity and approximation of the general setting with uncertainty regarding both the profits and the weights, for three differ...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Exact Complexity Results and Polynomial-Time Algorithms for Derivative Accumulation
We discuss the complexity of evaluating certain collections of monic multilinear polynomials using operations in {×, +}. The functions we consider, which are defined on paths in directed acyclic graphs (DAGs), represent derivative computations that are based on the chain rule and have direct applications in high-performance scientific computing. Our main results concern functions derived from s...
متن کاملAlgorithms and Complexity Results for Exact Bayesian Structure Learning
Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning under graph theoretic restrictions on the super-structure. The super-structure (a concept introduced by Perrier, Imoto, and Miyano, JMLR 2008) is an undirec...
متن کاملExact algorithms based on specific complexity measures for hard problems
At present, most of the important computational problems—be they decision, search, or optimization problems—are known to satisfy one of the following two criteria: 1. The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small enough to guarantee that the problem can be tackled efficiently in practice. In particular, the decision ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2013
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-013-0319-3